Divider-based algorithms for hierarchical tree partitioning
نویسندگان
چکیده
منابع مشابه
A Formal Methodology for Hierarchical Partitioning of Piecewise Linear Algorithms
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor array architectures has lead to demand for mapping tools to realize the full potential of these architectures. Such architectures are characterized by hierarchies of parallelism and memory structures, i.e. processor array ...
متن کاملDIAGNOSIS OF BREAST LESIONS USING THE LOCAL CHAN-VESE MODEL, HIERARCHICAL FUZZY PARTITIONING AND FUZZY DECISION TREE INDUCTION
Breast cancer is one of the leading causes of death among women. Mammography remains today the best technology to detect breast cancer, early and efficiently, to distinguish between benign and malignant diseases. Several techniques in image processing and analysis have been developed to address this problem. In this paper, we propose a new solution to the problem of computer aided detection and...
متن کاملRefinement Tree Based Partitioning for Adaptive Grids
We present a new partitioning algorithm for grids obtained by adaptive reenement. The method uses the adaptive reenement tree to obtain information unavailable to other partitioning methods which use only the nal grid and/or some geometric data. The algorithm requires (typically) O(log(N)) operations after an O(N) preprocessing step. The method is guaranteed to produce perfectly balanced connec...
متن کاملCoarse mesh partitioning for tree based AMR
In tree based adaptive mesh refinement, elements are partitioned between processes using a space filling curve. The curve establishes an ordering between all elements that derive from the same root element, the tree. When representing more complex geometries by patching together several trees, the roots of these trees form an unstructured coarse mesh. We present an algorithm to partition the el...
متن کاملTree-based Coarsening and Partitioning
Many applications produce massive complex networks whose5analysis would benefit from parallel processing. Parallel algorithms, in6turn, often require a suitable network partition. For solving optimization7tasks such as graph partitioning on large networks, multilevel methods8are preferred in practice. Yet, complex networks pose challenges to es-9tablished...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00443-8